Reduction from three-dimensional discrete tomography to multicommodity flow problem
نویسندگان
چکیده
منابع مشابه
On an integer multicommodity flow problem from the airplane industry
Here we discuss a new integer multicommodity ow problem in which the commodities can not be shipped independently. The problem emerges in the routing of airplane parts from production sites to assembly sites. The parts are of such size that they have to be carried on dedicated trailers. Each type of part has its own type of trailer. A part is loaded on its trailer after it is produced, carried ...
متن کاملAdvances in Solving the Multicommodity-Flow Problem
The multicommodity-flow problem arises in a wide variety of important applications. Many communications, logistics, manufacturing , and transportation problems can be formulated as large multicommodity-flow problems. During the last few years researchers have made steady advances in solving extremely large multicommodity-flow problems. This improvement has been due both to algorithmic and to ha...
متن کاملUncertain minimum cost multicommodity flow problem
This paper investigates the minimum cost multicommodity flow problem with uncertain costs and uncertain capacities. Uncertainty theory is used to deal with indeterminacy factors in uncertain network. An (α, β)-minimum cost multicommodity flow model is formulated. Some properties of the model are analyzed. An equivalence relationship between the (α, β)-minimum cost multicommodity flow and the mi...
متن کاملA Multicommodity Flow Approach to the Crew Rostering Problem
The problem of finding a work assignment for airline crew members in a given time horizon is addressed. In the literature this problem is usually referred to as the airline crew rostering problem. It consists of constructing monthly schedules for crew members by assigning them pairings, rest periods, annual and sick leave, training periods, union activities, and so forth, so as to satisfy the c...
متن کاملMulticommodity network flow approach to the railroad crew-scheduling problem
We present our solution to the crew-scheduling problem for North American railroads. (Crew scheduling in North America is very different from scheduling in Europe, where it has been well studied.) The crew-scheduling problem is to assign operators to scheduled trains over a time horizon at minimal cost while honoring operational and contractual requirements. Currently, decisions related to crew...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.08.016